On the sphere-decoding algorithm I. Expected complexity
نویسندگان
چکیده
منابع مشابه
On the Complexity of Sphere Decoding
Recently, sphere detection has emerged as a powerful means of finding the maximum likelihood solution to the detection problem for multiple-antenna (MIMO) systems. In this paper, we analyze the performance and computational complexity of different sphere detectors and compare it with that of already known MIMO receiver techniques, in uncoded as well as coded transmission1. We propose a number o...
متن کاملA New Low Computational Complexity Sphere Decoding Algorithm
The complexity of sphere decoding (SD) has been widely studied in that the algorithm is vital in providing the optimal Maximum Likelihood performance with low complexity. In this paper, we propose a proper tree search technique that reduces overall SD computational complexity without sacrificing performance. We build a check-table to pre-calculate and store some terms, temporally store some mid...
متن کاملMaximum-likelihood decoding and integer least-squares: The expected complexity
The problem of finding the least-squares solution to a system of linear equations where the unknown vector is comprised of integers, but the matrix coefficient and given vector are comprised of real numbers, arises in many applications: communications, cryptography, GPS, to name a few. The problem is equivalent to finding the closest lattice point to a given point and is known to be NP-hard. In...
متن کاملLimiting the Complexity of Sphere Decoding for UW-OFDM
The recently presented UW-OFDM (unique word orthogonal frequency division multiplexing) signaling scheme [1] uses certain subcarriers in frequency domain for calculated symbols instead of data, in order to introduce redundancy. The resulting linear OFDM system model can be interpreted as a fading multiple antenna system, which enables sophisticated detectors for data recovery, known for MIMO (m...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2005
ISSN: 1053-587X
DOI: 10.1109/tsp.2005.850352